منابع مشابه
Light edges in degree-constrained graphs
Let denote the average degree, and Æ denote the minimum degree of a graph. An edge is light if both its endpoints have degree bounded by a constant depending only on and Æ. A graph is degree-constrained if < 2Æ. The primary result of this paper is that every degree-constrained graph has a light edge. Most previous results in this direction have been for embedded graphs. This result is extended ...
متن کاملLight edges in 1-planar graphs with prescribed minimum degree
A graph is called 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. We prove that each 1-planar graph of minimum degree δ ≥ 4 contains an edge with degrees of its endvertices of type (4,≤ 13) or (5,≤ 9) or (6,≤ 8) or (7, 7). We also show that for δ ≥ 5 these bounds are best possible and that the list of edges is minimal (in the sense that, for each...
متن کاملDegree-constrained editing of small-degree graphs
This thesis deals with degree-constrained graph modification problems. In particular, we investigate the computational complexity of DAG Realization and Degree Anonymity. The DAG Realization problem is, given a multiset of positive integer pairs, to decide whether there is a realizing directed acyclic graph (DAG), that is, pairs are one-to-one assigned to vertices such that the indegree and the...
متن کاملDegree Constrained Orientations in Countable Graphs
Degree constrained orientations are orientations of an (undirected) graph where the in-degree function satisfies given lower and upper bounds. For finite graphs Frank and Gyárfás (1976) gave a necessary and sufficient condition for the existence of such an orientation. We extend their result to countable graphs.
متن کاملConnectivity keeping edges in graphs with large minimum degree
The old well-known result of Chartrand, Kaugars and Lick [1] says that every k-connected graph G with minimum degree at least 3k/2 has a vertex v such that G− v is still k-connected. In this paper, we consider a generalization of the above result. We prove the following result: Suppose G is a k-connected graph with minimum degree at least 3k/2 + 2. Then G has an edge e such that G− V (e) is sti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2003.12.003